Tree Valence Controlled Grammars
نویسندگان
چکیده
منابع مشابه
Nonterminal complexity of tree controlled grammars
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the number of nonterminals in tree controlled grammars without erasing rules leads to an infinite hierarchy of families of tree controlled languages, while every recursively enumerable language can be generated by a tree controlled grammar with erasing rules and at most nine nonterminals. © 2011 Elsevie...
متن کاملSubregularly Tree Controlled Grammars and Languages
Tree controlled grammars are context-free grammars where the associated language only contains those terminal words which have a derivation where the word of any level of the corresponding derivation tree belongs to a given regular language. We present some results on the power of such grammars where we restrict the regular languages to some known subclasses of the family of regular languages.
متن کاملTree-bank Grammars Tree-bank Grammars
By a \tree-bank grammar" we mean a context-free grammar created by reading the production rules directly from hand-parsed sentences in a tree bank. Common wisdom has it that such grammars do not perform well, though we know of no published data on the issue. The primary purpose of this paper is to show that the common wisdom is wrong. In particular we present results on a tree-bank grammar base...
متن کاملTree Grammars (Grammars)
i. This paper suggests a new kind of formal grammar (hereafter called A-grammarS) which in some respects is closely related to Chomsky's grammars but differs from these in that it is meant to process trees (in the sense of graph theory) and not to process strings as Chomsky's grammars do. More precisely, we aim at a type of grammar with rewriting rules of the'X ~Y" where X and Y are trees (N.B....
متن کاملContext-Free Valence Grammars - Revisited
Context-free valence languages (over Z k) are shown to be cod-ings of the intersection of a context-free language and a blind k-counter language. This afl-style characterization allows one to infer some of the properties of the family of valence languages, in particular the λ-free normal form proved by Fernau and Stiebe.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Perceptive and Cognitive Computing
سال: 2017
ISSN: 2462-229X
DOI: 10.31436/ijpcc.v3i1.48